Stateless Two-Stage Multiple Criteria Scheduling in Nuclear Medicine
نویسندگان
چکیده
منابع مشابه
On Scheduling Two-Stage Jobs on Multiple Two-Stage Flowshops
Motivated by the current research in data centers and cloud computing, we study the problem of scheduling a set of two-stage jobs on multiple two-stage flowshops. A new formulation for configurations of such scheduling is proposed, which leads directly to improvements to the complexity of scheduling algorithms for the problem. Motivated by the observation that the costs of the two stages can be...
متن کاملBi-criteria Three Stage Fuzzy Flowshop Scheduling with Transportation Time and Job Block Criteria
Scheduling is an enduring process where the existence of real time information frequently forces the review and modification of pre-established schedules. The real world is complex and complexity generally arises from uncertainty. From this prospective the concept of fuzziness is introduced in the field of scheduling. The present paper pertains to a bi-criterion in n-jobs, three machines fl...
متن کاملUnderstanding appropriate use criteria in nuclear medicine.
There has been a significant increase in cardiac radionuclide imaging over the past decade, leading to a corresponding increase in scrutiny from Federal and private health plans questioning the necessity of these tests. In response to efforts by third-party payers to limit all types of cardiovascular imaging studies, the American College of Cardiology Foundation, in conjunction with other profe...
متن کاملA Two-Stage Hybrid Flowshop Scheduling Problem with Serial Batching
In this paper the problem of serial batch scheduling in a two-stage hybrid flow shop environment with minimizing Makesapn is studied. In serial batching it is assumed that jobs in a batch are processed serially, and their completion time is defined to be equal to the finishing time of the last job in the batch. The analysis and implementation of the prohibited transference of jobs among the mac...
متن کاملComplexity of two dual criteria scheduling problems
In this article we answer the complexity question of two dual criteria scheduling problems which had been open for a long time. Both problems are single machine scheduling problems and both have the number of tardy jobs as the primary criterion. However, the first problem has the total completion time and the second one has the total tardiness as the secondary criterion. We show that both probl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Problems in Engineering
سال: 2014
ISSN: 1024-123X,1563-5147
DOI: 10.1155/2014/646249